Crew Pairing Optimization with Genetic Algorithms

نویسندگان

  • Harry Kornilakis
  • Panagiotis Stamatopoulos
چکیده

We present an algorithm for the crew pairing problem, an optimization problem that is part of the airline crew scheduling procedure. A pairing is a round trip starting and ending at the home base, which is susceptible to constraints that arise due to laws and regulations. The purpose of the crew pairing problem is to generate a set of pairings with minimal cost, covering all flight legs that the company has to carry out during a predefined time period. The proposed solution is a two-phase procedure. For the first phase, the pairing generation, a depth first search approach is employed. The second phase deals with the selection of a subset of the generated pairings with near optimal cost. This problem, which is modelled by a set covering formulation, is solved with a genetic algorithm. The presented method was tested on actual flight data of Olympic Airways.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach

Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...

متن کامل

Multiobjective Optimization Genetic Algorithms for Domestic Airline Crew Pairing Problems

Airline crew pairing problems involve assigning the required crew members to each flight segment in a given time period, while complying with a variety of work regulations and collective agreements. Traditional researches formulate the pairing problems as integer programming problems, and use deterministic approaches to optimize the solutions. Such these approaches usually suffer from some crit...

متن کامل

Airlines’ Crew Pairing Optimization: A Brief Review

In most airlines, crew costs are the second largest direct operation cost next to the fuel costs. But unlike the fuel costs, a considerable portion of the crew costs can be saved through optimized utilization of the internal resources of an airline company. And the saving is largely realized through solving the crew pairing problem. This paper aims to give a brief review of the fundamental crew...

متن کامل

Models and Algorithms for an Integrated Fleet-Assignment, Aircraft-Routing and Crew-Pairing Problem

We study an optimization problem of a regional airline company. The problem integrates three stages of the planning process that are typically solved in sequence: fleet assignment, aircraft routing and crew pairing. Aircraft maintenance is also taken into account. We present two mathematical formulations for the integrated problem. One formulation could be considered the natural model where bot...

متن کامل

Optimization of Short-haul Airline Crew Pairing Problems Using a Multiobjective Genetic Algorithm

Airline crew pairing problems involve optimizing an overall evaluation function containing various conflicting objectives and constraints originating from cost and safety considerations. Classical approaches based on set partitioning or set covering methods separate the solution into two phases, pairing generation and pairing optimization, and evaluate the cost by a weighted-sum of objective va...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002